[20250208] BOJ / 골드4 / 창영이와 퇴근 / 이강현 #62
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/22116
🧭 풀이 시간
120분
👀 체감 난이도
✏️ 문제 설명
NXN 위에 높이가 저장되어 있고 (0,0)부터 (N-1,N-1)까지 이동할 때 최대 경사의 최솟값을 구하는 문제
🔍 풀이 방법
다익스트라 혹은 BFS+이분탐색
⏳ 회고
일반적인 다익스트라 문제처럼 가중치의 합을 이용하여 해결하려고 했으나 문제를 다시 잘 읽어보면 최대 경사의 최솟값을 구하는 문제였다. 목적지까지 가는 오르막 경사의 총합의 최소가 아니라 경로중 나올 수 있는 최대 경사의 최솟값을 얻는 문제.